Number : ENDO : 0196

نویسندگان

  • Gregory E. Demas
  • Lance J. Kriegsfeld
چکیده

p0010 As most people have experienced throughout their lifetimes, timing is everything. The ability to modify one’s behavior or physiology on a regular basis, be it daily, monthly, or yearly, is arguably one of the most adaptive responses of life and occurs in virtually all organisms, ranging from single-celled algae to complex humans. But why have biological rhythms evolved, and what functions do they serve? All physiological systems require proper coordination and synchronization with one another to ensure that a wide variety of rhythmic events can occur during an optimal time of the day or year. For example, for the body to prepare appropriately to digest a meal, numerous physiological processes must occur in anticipation of eating. Many species must also predict the time of year to coordinate breeding activities. These daily and yearly changes require critical coordination among numerous internal processes necessary to maintain homeostasis. Furthermore, for biological rhythms in behavior and physiology to be coordinated with the appropriate time, these rhythms need to be synchronized to external time cues within the environment. The means by which intrinsic rhythms are generated by a clock in the brain, and how these rhythms are synchronized to local time, is the primary focus of the study of biological rhythms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequence Comparison with Mixed Convex and Concave Costs

Recently a number of algorithms have been developed for solving the minimum-weight edit sequence problem with non-linear costs for multiple insertions and deletions. We extend these algorithms to cost functions that are neither convex nor concave, but a mixture of both. We also apply this technique to related dynamic programming algorithms.

متن کامل

An Algorithm for Outerplanar Graphs with Parameter

For n-vertex outerplanar graphs, it is proven that O(n) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An O(n) algorithm for finding the solution is proposed.

متن کامل

Searching Ordered Structures

Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest. t19x5 ...

متن کامل

On the Minimum Number of Additions Required to Compute a Quadratic Form

Let &(x,, . . . xn) = C, ci<iGn~i~i. Vari has proved that (n 1) multiplications are necessary to compute S,,, but the minimum number of additions required to compute S, was left as an open problem in [ 1, p. 4981. We show that (2n 4) additions are necessary to compute S,, which would settle the problem. For the evaluation of the quadratic form we consider normal evaluation schemes in which all ...

متن کامل

Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records

The worst-case performance of a linear probing algorithm is studied under assumption that each of m locations can contain at most one record. It is shown that the length of the longest sequence of probes needed to insert (locate) a record grows, in probability, as c-‘log m if m and n. the total number of records, approach 03 in such a way that the load factor a = n/m is bounded away from 0 and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003